Simulated Analog Computation
نویسندگان
چکیده
This paper describes an approach to solving differential equations based on a block diagram solver. We call this solver Simulated Analog Computer (SAC) because our computational model took inspiration from the structure of the Analog Computers.. The model of analog computation offers an elegant representation of the solution to systems of differential equations encountered in modeling and simulation and gave us the opportunity to define a solver with unique characteristics..
منابع مشابه
Towards Analog Reverse Time Computation
We report the consequences of a destabilization process on a simulated General Purpose Analog Computer. This new technology overcomes problems linked with serial ambiguity, and provides an analog bias to encode algorithms whose complexity is over polynomial. We also implicitly demonstrate how countermesures of the Stochastic Aperture Degeneracy could efficiently reach higher computational class...
متن کاملAnalog Nanoelectronic Computation: I. Simulation Of Dynamical Systems
We describe here a new strategy for computation and computer design optimized for simulation of complex (chaotic) dynamical systems. This strategy has the potential for performance many orders of magnitude higher than conventional digital computers. It combines three emerging technologies, collectively referred to as nanologic: (1) analog nanoelectronics; (2) adaptive analog arrays; and (3) top...
متن کاملEdge of Chaos Computation in Mixed-Mode VLSI - A Hard Liquid
Computation without stable states is a computing paradigm different from Turing’s and has been demonstrated for various types of simulated neural networks. This publication transfers this to a hardware implemented neural network. Results of a software implementation are reproduced showing that the performance peaks when the network exhibits dynamics at the edge of chaos. The liquid computing ap...
متن کاملTuring Machines Can Be Efficiently Simulated by the General Purpose Analog Computer
The Church-Turing thesis states that any sufficiently powerful computational model which captures the notion of algorithm is computationally equivalent to the Turing machine. This equivalence usually holds both at a computability level and at a computational complexity level modulo polynomial reductions. However, the situation is less clear in what concerns models of computation using real numb...
متن کاملSimulations of a graphene excitable laser for spike processing
We propose and simulate a novel excitable laser employing passively Q-switching with a graphene saturable absorber for spike processing. Our approach combines the picosecond processing and switching capabilities of both linear and nonlinear optical device technologies to integrate both analog and digital optical processing into a single hardware architecture capable of computation without the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003